Apparatus for pari-mutuel racing game with finish order betting

ABSTRACT

In various embodiments, a device may test the health of race participants in order to ensure the fairness of a bet on an order of finish.

This application is a continuation of U.S. patent application Ser. No.15/593,907 filed May 12, 2017 which is a continuation of U.S. patentapplication Ser. No. 11/868,673 filed Oct. 8, 2007 (now U.S. Pat. No.9,652,926) which claims priority to U.S. Provisional Application Ser.No. 60/828,516, filed Oct. 6, 2006, all of which are incorporated byreference herein in their entireties:

BACKGROUND

Racing games have, at times, enjoyed some popularity. Some games allowpari-mutuel betting.

SUMMARY

In various embodiments, a person may bet on the order in which racingparticipants may finish.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a scale according to some embodiments.

FIG. 2 shows a schematic diagram of a scale according to someembodiments.

FIG. 3 shows a schematic diagram of a component of a scale according tosome embodiments.

FIG. 4 shows a ticket according to some embodiments.

FIG. 5 shows a betting apparatus according to some embodiments.

FIG. 6 shows a schematic diagram of a betting apparatus according tosome embodiments.

FIG. 7 shows a schematic diagram of server according to someembodiments.

FIG. 8 shows a display according to some embodiments.

DETAILED DESCRIPTION

In various embodiments, bettors at a race, such as at a horse race, maybet that participants in the race will finish in a particular order. Oneparticular order may represent a “least likely” order, or reverse order,such that participants finish exactly opposite to the way payoff oddsfrom a pari-mutuel system would predict. For example, the particularorder may have the horse which is favored to win finishing last, thehorse which is the next most favored finishing second to last, and soon. A bet on such a finish in reverse order may be termed a “reversebet” herein.

In various embodiments it may be very unlikely that participants in arace finish in reverse order, especially if there are a significantnumber of participants, such as eight, or twelve participants. Thus,large payouts may be offered for a bet made on a reverse order finish.

In various embodiments, with the potential for large payouts may comethe potential for manipulation. A horse that is favored to win a racemay turn out to be slightly injured. A person with inside knowledge ofthe horse's condition could make a bet on the reverse finish, knowingthat the favored horse will likely finish last, and thereby making thereverse finish far more likely.

According to some embodiments, a specialized scale is used to test ahorse for injuries. FIG. 1 shows a scale 105 according to someembodiments. Four weighing units, 110, 115, 120, and 125 may eachseparately take a weight measurement. The units may be configured sothat a horse (e.g., horse 135) may have one leg on each unit. The unitsmay be linked by cables or wires (e.g., cable 130) or may communicatewirelessly. A schematic diagram of the scale 105 is shown in FIG. 2.

In operation, a horse 135 may stand with one leg on each unit. Weightreadings may thereupon be taken at each unit. The horse may be kept onthe scale 105 for some period of time (e.g., for one minute), so thatweight readings may be taken as a function of time. Weight readings maybe analyzed at one of the units (e.g., at unit 115). FIG. 3 depicts aschematic diagram of unit 115. Unit 115 may include a storage device 325with a weight readings database 330 for storing weight readings gatheredfrom the four units. Unit 115 may further include a communications port320, which may receive communications from other units, which may sendinstructions or other communications to other units, and/or which maycommunicate with other devices. Unit 115 may include a weight sensor310. Other units may also include such a sensor. The weight sensor maysense the weight of the horse on the unit. Unit 115 may include aprocessor for interpreting weight readings. Display 315 may provide anindication of weight or an indication other messages, such asindications of whether or not the horse is fit.

In various embodiments, the scale 105 seeks to determine if the horse isfavoring one or more legs with its weight. A horse that has a leg injurymay tend to put less weight on the injured leg than it does on otherlegs. The scale may compare weight readings from the two front units(e.g., 110 and 115). The scale may compare weight readings from the twoback units. The scale may compare two weight readings from any otherunits. If weight readings from two units being compared diverge by morethan a predetermined weight (e.g., 40 pounds), then processor 305 maydetermine that the horse is injured. In some embodiments, if weightreadings differ by more than a predetermined percentage (e.g., by morethan 10%), then processor 305 may determine that the horse is injured.Based on determinations made by the processor, display 315 may display amessage. The message may read, for example, “horse is fit,” or “horse isinjured.” The display may also show actual weight readings, percentagedifferences in weight readings, and so on.

In various embodiments, it may be anticipated that the horse willnaturally shift his weight back and forth. Thus, weight readings may becaptured over time. The weight readings may then be averaged together toarrive at an average reading at one of the units. For example, a givenunit may take weight readings once per second for 60 seconds. The unitmay then average the weight readings to determine an average weightplaced by the horse on that unit. Thus, even if the horse is shiftinghis weight from leg to leg, the units may be able to capture an averageweight reading that represents the weight a horse would put on a givenleg if it were standing completely still.

Reverse Bet

FIG. 4 shows a ticket, receipt, betting slip, or other indication orrepresentation of a bet that has been made by a bettor. The ticket 405includes a name of the racetrack, (e.g., “Greenfield Racetrack”), anindication of the type of bet (e.g., “Reverse Bet”), an explanation ofthe bet, a date the bet was made, a race on which the bet was made, anamount of the bet, a potential prize for the bet, a betting terminal atwhich the bet was made, an identifier for the ticket, and a bar code. Itwill be appreciated that not all items of information depicted on theticket 405 may be shown, or that additional items may be shown. Theticket 405 may allow the player to claim his prize in the event that thebet is successful (e.g., in the event that horses in race 6 do finish inthe reverse order of expectation). If the bet is successful, the playermay bring the ticket to a desk at a race track, or may insert it into abetting terminal, kiosk, or other device.

FIG. 5 shows a betting terminal 500 according to some embodiments. Thebetting terminal may allow a player to place bets on one or more races.Such bets may include bets on a horse to win a race, bets on all horsesin a race to finish in reverse order of expectation, or any other bets.The terminal may also allow other transactions, such allowing a playerto claim winnings from a successful bet. The terminal may include adisplay 505, a cash acceptor 510, a card acceptor (e.g., a credit cardacceptor, e.g., a debit card acceptor, e.g., an acceptor of anidentification card for a player), a keypad 520 or other input device, aticket printer 525, ticket reader 530, a trackball or other input device535, and a cash dispenser 540. As will be appreciated, a bettingterminal may take many other configurations.

FIG. 6 shows a schematic representation of a betting terminal 500according to some embodiments.

FIG. 7 shows a schematic representation of a server 700, according tosome embodiments. The server may receive (e.g., via the communicationsport 710) indications of bets that have been made at betting terminals,such as at betting terminals located throughout a racetrack. The servermay keep track of outstanding bets, e.g., using a memory 715 with anoutstanding bets database 720. From the outstanding bets, the server maybe able to compute (e.g., using processor 705) odds on various horses,payouts due to particular players, and the order of finish that would bewinning for a reverse bet. The player database 725 may allow the serverto track the betting histories of players, to allow the server to verifyan identifying document presented by a player in conjunction with awinning ticket, or to perform any other function.

The server 700 may supply data for a public display 810 (shown in FIG.8), such a tote board. The data presented may include gate numbers orhorse numbers for a particular race (e.g., for the next scheduled race),horse names, and current payoff odds for someone betting on a givenhorse to win. As shown in FIG. 8, for example, the horse named “WhizTail” is scheduled to start the next race out of gate 1. A player whohas bet 2 on Whiz Tail stands to win 33 should Whiz Tail win the race.

FIG. 8 also shows an indication 820 of the current order of finish thatwould be required for the reverse bet to pay. As shown in the figure,the horses must finish in the following gate order: #8, #6, #1, #4, #5,#2, #3, and #7 for the reverse bet to pay. This order corresponds, inthis case, to the least favored horse winning the race (i.e., the horsewith the highest payoff odds), the next least favorite horse finishingsecond, and so on.

In some embodiments, various bettors may continue to place bets on oneor more of the horses to win. Betting may continue until some cutofftime, such as five minutes before the race is scheduled to start. Asmore bets are placed, the payoff odds may change, since the payoff oddsmay depend on what bets have been placed in a pari-mutuel system. Thus,the finish order required for the reverse bet to pay may also change.

In various embodiments, a person who places a reverse bet may win hisbet if the horses finish in the reverse order of expectation at the timehe places his bet. Thus, even if the expected order of finish changeslater, the person may still win if the reverse order of expected finishoccurs based on when he made his bet. In some embodiments, a person whomakes a reverse bet only wins if the horses finish in the reverse orderof expectation for the moment in time when betting closes.

In various embodiments, more or less information may be displayed on thedisplay 810.

The following sections I-X provide a guide to interpreting the presentapplication.

I. Determining

The term “determining” and grammatical variants thereof (e.g., todetermine a price, determining a value, determine an object which meetsa certain criterion) is used in an extremely broad sense. The term“determining” encompasses a wide variety of actions and therefore“determining” can include calculating, computing, processing, deriving,investigating, looking up (e.g., looking up in a table, a database oranother data structure), ascertaining and the like. Also, “determining”can include receiving (e.g., receiving information), accessing (e.g.,accessing data in a memory) and the like. Also, “determining” caninclude resolving, selecting, choosing, establishing, and the like.

The term “determining” does not imply certainty or absolute precision,and therefore “determining” can include estimating, extrapolating,predicting, guessing and the like.

The term “determining” does not imply that mathematical processing mustbe performed, and does not imply that numerical methods must be used,and does not imply that an algorithm or process is used.

The term “determining” does not imply that any particular device must beused. For example, a computer need not necessarily perform thedetermining.

II. Forms of Sentences

Where a limitation of a first claim would cover one of a feature as wellas more than one of a feature (e.g., a limitation such as “at least onewidget” covers one widget as well as more than one widget), and where ina second claim that depends on the first claim, the second claim uses adefinite article “the” to refer to the limitation (e.g., “the widget”),this does not imply that the first claim covers only one of the feature,and this does not imply that the second claim covers only one of thefeature (e.g., “the widget” can cover both one widget and more than onewidget).

When an ordinal number (such as “fire, ” “second”, “third” and so on) isused as an adjective before a term, that ordinal number is used (unlessexpressly specified otherwise) merely to indicate a particular feature,such as to distinguish that particular feature from another feature thatis described by the same term or by a similar term. For example, a“first widget” may be so named merely to distinguish it from, e.g., a“second widget”. Thus, the mere usage of the ordinal numbers “first” and“second” before the term “widget” does not indicate any otherrelationship between the two widgets, and likewise does not indicate anyother characteristics of either or both widgets. For example, the mereusage of the ordinal numbers “first” and “second” before the term“widget” (1) does not indicate that either widget comes before or afterany other in order or location; (2) does not indicate that either widgetoccurs or acts before or after any other in time; and (3) does notindicate that either widget ranks above or below any other, as inimportance or quality. In addition, the mere usage of ordinal numbersdoes not define a numerical limit to the features identified with theordinal numbers. For example, the mere usage of the ordinal numbers“first” and “second” before the term “widget” does not indicate thatthere must be no more than two widgets.

When a single device, article or other product is described herein, morethan one device/article (whether or not they cooperate) mayalternatively be used in place of the single device/article that isdescribed. Accordingly, the functionality that is described as beingpossessed by a device may alternatively be possessed by more than onedevice/article (whether or not they cooperate).

Similarly, where more than one device, article or other product isdescribed herein (whether or not they cooperate), a singledevice/article may alternatively be used in place of the more than onedevice or article that is described. For example, a plurality ofcomputer-based devices may be substituted with a single computer-baseddevice. Accordingly, the various functionality that is described asbeing possessed by more than one device or article may alternatively bepossessed by a single device/article.

The functionality and/or the features of a single device that isdescribed may be alternatively embodied by one or more other deviceswhich are described but are not explicitly described as having suchfunctionality/features. Thus, other embodiments need not include thedescribed device itself, but rather can include the one or more otherdevices which would, in those other embodiments, have suchfunctionality/features.

III. Terms

The term “product” means any machine, manufacture and/or composition ofmatter, unless expressly specified otherwise.

The term “process” means any process, algorithm, method or the like,unless expressly specified otherwise.

Each process (whether called a method, algorithm or otherwise)inherently includes one or more steps, and therefore all references to a“step” or “steps” of a process have an inherent antecedent basis in themere recitation of the term ‘process’ or a like term. Accordingly, anyreference in a claim to a ‘step’ or ‘steps’ of a process has sufficientantecedent basis.

The term “invention” and the like mean “the one or more inventionsdisclosed in this application”, unless expressly specified otherwise.

The terms “an embodiment”, “embodiment”, “embodiments”, “theembodiment”, “the embodiments”, “one or more embodiments”, “someembodiments”, “certain embodiments”, “one embodiment”, “anotherembodiment” and the like mean “one or more (but not all) embodiments ofthe disclosed invention(s)”, unless expressly specified otherwise.

The term “variation” of an invention means an embodiment of theinvention, unless expressly specified otherwise.

A reference to “another embodiment” in describing an embodiment does notimply that the referenced embodiment is mutually exclusive with anotherembodiment (e.g., an embodiment described before the referencedembodiment), unless expressly specified otherwise.

The terms “including”, “comprising” and variations thereof mean“including but not limited to”, unless expressly specified otherwise.

The terms “a”, “an” and “the” mean “one or more”, unless expresslyspecified otherwise.

The term “plurality” means “two or more”, unless expressly specifiedotherwise.

The term “herein” means “in the present application, including anythingwhich may be incorporated by reference”, unless expressly specifiedotherwise.

The phrase “at least one of”, when such phrase modifies a plurality ofthings (such as an enumerated list of things) means any combination ofone or more of those things, unless expressly specified otherwise. Forexample, the phrase “at least one of a widget, a car and a wheel” meanseither (i) a widget, (ii) a car, (iii) a wheel, (iv) a widget and a car,(v) a widget and a wheel, (vi) a car and a wheel, or (vii) a widget, acar and a wheel. The phrase “at least one of”, when such phrase modifiesa plurality of things does not mean “one of” each of the plurality ofthings.

Numerical terms such as “one”, “two”, etc. when used as cardinal numbersto indicate quantity of something (e.g., one widget, two widgets), meanthe quantity indicated by that numerical term, but do not mean at leastthe quantity indicated by that numerical term. For example, the phrase“one widget” does not mean “at least one widget”, and therefore thephrase “one widget” does not cover, e.g., two widgets.

The phrase “based on” does not mean “based only on”, unless expresslyspecified otherwise. In other words, the phrase “based on” describesboth “based only on” and “based at least on”. The phrase “based at leaston” is equivalent to the phrase “based at least in part on”.

The term “represent” and like terms are not exclusive, unless expresslyspecified otherwise. For example, the term “represents” do not mean“represents only”, unless expressly specified otherwise. In other words,the phrase “the data represents a credit card number” describes both“the data represents only a credit card number” and “the data representsa credit card number and the data also represents something else”.

The term “whereby” is used herein only to precede a clause or other setof words that express only the intended result, objective or consequenceof something that is previously and explicitly recited. Thus, when theterm “whereby” is used in a claim, the clause or other words that theterm “whereby” modifies do not establish specific further limitations ofthe claim or otherwise restricts the meaning or scope of the claim.

The term “e.g.” and like terms mean “for example”, and thus does notlimit the term or phrase it explains. For example, in the sentence “thecomputer sends data (e.g., instructions, a data structure) over theInternet”, the term “e.g.” explains that “instructions” are an exampleof “data” that the computer may send over the Internet, and alsoexplains that “a data structure” is an example of “data” that thecomputer may send over the Internet. However, both “instructions” and “adata structure” are merely examples of “data”, and other things besides“instructions” and “a data structure” can be “data”.

The term “respective” and like terms mean “taken individually”. Thus iftwo or more things have “respective” characteristics, then each suchthing has its own characteristic, and these characteristics can bedifferent from each other but need not be. For example, the phrase “eachof two machines has a respective function” means that the first suchmachine has a function and the second such machine has a function aswell. The function of the first machine may or may not be the same asthe function of the second machine.

The term “i.e.” and like terms mean “that is”, and thus limits the termor phrase it explains. For example, in the sentence “the computer sendsdata (i.e., instructions) over the Internet”, the term “i.e.” explainsthat “instructions” are the “data” that the computer sends over theInternet.

Any given numerical range shall include whole and fractions of numberswithin the range. For example, the range “1 to 10” shall be interpretedto specifically include whole numbers between 1 and 10 (e.g., 1, 2, 3,4, . . . 9) and non-whole numbers (e.g., 1.1, 1.2, . . . 1.9).

Where two or more terms or phrases are synonymous (e.g., because of anexplicit statement that the terms or phrases are synonymous), instancesof one such term/phrase does not mean instances of another suchterm/phrase must have a different meaning. For example, where astatement renders the meaning of “including” to be synonymous with“including but not limited to”, the mere usage of the phrase “includingbut not limited to” does not mean that the term “including” meanssomething other than “including but not limited to”.

IV. Disclosed Examples and Terminology Are Not Limiting

Neither the Title (set forth at the beginning of the first page of thepresent application) nor the Abstract (set forth at the end of thepresent application) is to be taken as limiting in any way as the scopeof the disclosed invention(s). An Abstract has been included in thisapplication merely because an Abstract of not more than 150 words isrequired under 37 C.F.R. § 1.72(b).

The title of the present application and headings of sections providedin the present application are for convenience only, and are not to betaken as limiting the disclosure in any way.

Numerous embodiments are described in the present application, and arepresented for illustrative purposes only. The described embodiments arenot, and are not intended to be, limiting in any sense. The presentlydisclosed invention(s) are widely applicable to numerous embodiments, asis readily apparent from the disclosure. One of ordinary skill in theart will recognize that the disclosed invention(s) may be practiced withvarious modifications and alterations, such as structural, logical,software, and electrical modifications. Although particular features ofthe disclosed invention(s) may be described with reference to one ormore particular embodiments and/or drawings, it should be understoodthat such features are not limited to usage in the one or moreparticular embodiments or drawings with reference to which they aredescribed, unless expressly specified otherwise.

No embodiment of method steps or product elements described in thepresent application constitutes the invention claimed herein, or isessential to the invention claimed herein, or is coextensive with theinvention claimed herein, except where it is either expressly stated tobe so in this specification or expressly recited in a claim.

The preambles of the claims that follow recite purposes, benefits andpossible uses of the claimed invention only and do not limit the claimedinvention.

The present disclosure is not a literal description of all embodimentsof the invention(s). Also, the present disclosure is not a listing offeatures of the invention(s) which must be present in all embodiments.

Devices that are described as in communication with each other need notbe in continuous communication with each other, unless expresslyspecified otherwise. On the contrary, such devices need only transmit toeach other as necessary or desirable, and may actually refrain fromexchanging data most of the time. For example, a machine incommunication with another machine via the Internet may not transmitdata to the other machine for long period of time (e.g. weeks at atime). In addition, devices that are in communication with each othermay communicate directly or indirectly through one or moreintermediaries.

A description of an embodiment with several components or features doesnot imply that all or even any of such components/features are required.On the contrary, a variety of optional components are described toillustrate the wide variety of possible embodiments of the presentinvention(s). Unless otherwise specified explicitly, nocomponent/feature is essential or required.

Although process steps, algorithms or the like may be described orclaimed in a particular sequential order, such processes may beconfigured to work in different orders. In other words, any sequence ororder of steps that may be explicitly described or claimed does notnecessarily indicate a requirement that the steps be performed in thatorder. The steps of processes described herein may be performed in anyorder possible. Further, some steps may be performed simultaneouslydespite being described or implied as occurring non-simultaneously(e.g., because one step is described after the other step). Moreover,the illustration of a process by its depiction in a drawing does notimply that the illustrated process is exclusive of other variations andmodifications thereto, does not imply that the illustrated process orany of its steps are necessary to the invention(s), and does not implythat the illustrated process is preferred.

Although a process may be described as including a plurality of steps,that does not imply that all or any of the steps are preferred,essential or required. Various other embodiments within the scope of thedescribed invention(s) include other processes that omit some or all ofthe described steps. Unless otherwise specified explicitly, no step isessential or required.

Although a process may be described singly or without reference to otherproducts or methods, in an embodiment the process may interact withother products or methods. For example, such interaction may includelinking one business model to another business model. Such interactionmay be provided to enhance the flexibility or desirability of theprocess.

Although a product may be described as including a plurality ofcomponents, aspects, qualities, characteristics and/or features, thatdoes not indicate that any or all of the plurality are preferred,essential or required. Various other embodiments within the scope of thedescribed invention(s) include other products that omit some or all ofthe described plurality.

An enumerated list of items (which may or may not be numbered) does notimply that any or all of the items are mutually exclusive, unlessexpressly specified otherwise. Likewise, an enumerated list of items(which may or may not be numbered) does not imply that any or all of theitems are comprehensive of any category, unless expressly specifiedotherwise. For example, the enumerated list “a computer, a laptop, aPDA” does not imply that any or all of the three items of that list aremutually exclusive and does not imply that any or all of the three itemsof that list are comprehensive of any category.

An enumerated list of items (which may or may not be numbered) does notimply that any or all of the items are equivalent to each other orreadily substituted for each other.

All embodiments are illustrative, and do not imply that the invention orany embodiments were made or performed, as the case may be.

V. Computing

It will be readily apparent to one of ordinary skill in the art that thevarious processes described herein may be implemented by, e.g.,appropriately programmed general purpose computers, special purposecomputers and computing devices. Typically a processor (e.g., one ormore microprocessors, one or more microcontrollers, one or more digitalsignal processors) will receive instructions (e.g., from a memory orlike device), and execute those instructions, thereby performing one ormore processes defined by those instructions. Instructions may beembodied in, e.g., one or more computer programs, one or more scripts.

A “processor ” means one or more microprocessors, central processingunits (CPUs), computing devices, microcontrollers, digital signalprocessors, or like devices or any combination thereof, regardless ofthe architecture (e.g., chip-level multiprocessing/multi-core, RISC,CISC, Microprocessor without Interlocked Pipeline Stages, pipeliningconfiguration, simultaneous multithreading).

Thus a description of a process is likewise a description of anapparatus for performing the process. The apparatus that performs theprocess can include, e.g., a processor and those input devices andoutput devices that are appropriate to perform the process.

Further, programs that implement such methods (as well as other types ofdata) may be stored and transmitted using a variety of media (e.g.,computer readable media) in a number of manners. In some embodiments,hard-wired circuitry or custom hardware may be used in place of, or incombination with, some or all of the software instructions that canimplement the processes of various embodiments. Thus, variouscombinations of hardware and software may be used instead of softwareonly.

The term “computer-readable medium” refers to any medium, a plurality ofthe same, or a combination of different media, that participate inproviding data (e.g., instructions, data structures) which may be readby a computer, a processor or a like device. Such a medium may take manyforms, including but not limited to, non-volatile media, volatile media,and transmission media. Non-volatile media include, for example, opticalor magnetic disks and other persistent memory. Volatile media includedynamic random access memory (DRAM), which typically constitutes themain memory. Transmission media include coaxial cables, copper wire andfiber optics, including the wires that comprise a system bus coupled tothe processor. Transmission media may include or convey acoustic waves,light waves and electromagnetic emissions, such as those generatedduring radio frequency (RF) and infrared (IR) data communications.Common forms of computer-readable media include, for example, a floppydisk, a flexible disk, hard disk, magnetic tape, any other magneticmedium, a CD-ROM, DVD, any other optical medium, punch cards, papertape, any other physical medium with patterns of holes, a RAM, a PROM,an EPROM, a FLASH-EEPROM, any other memory chip or cartridge, a carrierwave as described hereinafter, or any other medium from which a computercan read.

Various forms of computer readable media may be involved in carryingdata (e.g. sequences of instructions) to a processor. For example, datamay be (i) delivered from RAM to a processor; (ii) carried over awireless transmission medium; (iii) formatted and/or transmittedaccording to numerous formats, standards or protocols, such as Ethernet(or IEEE 802.3), SAP, ATP, Bluetooth

, and TCP/IP, TDMA, CDMA, and 3G; and/or (iv) encrypted to ensureprivacy or prevent fraud in any of a variety of ways well known in theart.

Thus a description of a process is likewise a description of acomputer-readable medium storing a program for performing the process.The computer-readable medium can store (in any appropriate format) thoseprogram elements which are appropriate to perform the method.

Just as the description of various steps in a process does not indicatethat all the described steps are required, embodiments of an apparatusinclude a computer/computing device operable to perform some (but notnecessarily all) of the described process.

Likewise, just as the description of various steps in a process does notindicate that all the described steps are required, embodiments of acomputer-readable medium storing a program or data structure include acomputer-readable medium storing a program that, when executed, cancause a processor to perform some (but not necessarily all) of thedescribed process.

Where databases are described, it will be understood by one of ordinaryskill in the art that (i) alternative database structures to thosedescribed may be readily employed, and (ii) other memory structuresbesides databases may be readily employed. Any illustrations ordescriptions of any sample databases presented herein are illustrativearrangements for stored representations of information. Any number ofother arrangements may be employed besides those suggested by, e.g.,tables illustrated in drawings or elsewhere. Similarly, any illustratedentries of the databases represent exemplary information only; one ofordinary skill in the art will understand that the number and content ofthe entries can be different from those described herein. Further,despite any depiction of the databases as tables, other formats(including relational databases, object-based models and/or distributeddatabases) could be used to store and manipulate the data typesdescribed herein. Likewise, object methods or behaviors of a databasecan be used to implement various processes, such as the describedherein. In addition, the databases may, in a known manner, be storedlocally or remotely from a device which accesses data in such adatabase.

Various embodiments can be configured to work in a network environmentincluding a computer that is in communication (e.g., via acommunications network) with one or more devices. The computer maycommunicate with the devices directly or indirectly, via any wired orwireless medium (e.g. the Internet, LAN, WAN or Ethernet, Token Ring, atelephone line, a cable line, a radio channel, an optical communicationsline, commercial on-line service providers, bulletin board systems, asatellite communications link, a combination of any of the above). Eachof the devices may themselves comprise computers or other computingdevices, such as those based on the Intel® Pentium® or Centrino™processor, that are adapted to communicate with the computer. Any numberand type of devices may be in communication with the computer.

In an embodiment, a server computer or centralized authority may not benecessary or desirable. For example, the present invention may, in anembodiment, be practiced on one or more devices without a centralauthority. In such an embodiment, any functions described herein asperformed by the server computer or data described as stored on theserver computer may instead be performed by or stored on one or moresuch devices.

Where a process is described, in an embodiment the process may operatewithout any user intervention. In another embodiment, the processincludes some human intervention (e.g., a step is performed by or withthe assistance of a human).

VI. Continuing Applications

The present disclosure provides, to one of ordinary skill in the art, anenabling description of several embodiments and/or inventions. Some ofthese embodiments and/or inventions may not be claimed in the presentapplication, but may nevertheless be claimed in one or more continuingapplications that claim the benefit of priority of the presentapplication.

Applicants intend to file additional applications to pursue patents forsubject matter that has been disclosed and enabled but not claimed inthe present application.

VII. 35 U.S.C. § 112, Paragraph 6

In a claim, a limitation of the claim which includes the phrase “meansfor” or the phrase “step for” means that 35 U.S.C. § 112, paragraph 6,applies to that limitation.

In a claim, a limitation of the claim which does not include the phrase“means for” or the phrase “step for” means that 35 U.S.C. § 112,paragraph 6 does not apply to that limitation, regardless of whetherthat limitation recites a function without recitation of structure,material or acts for performing that function. For example, in a claim,the mere use of the phrase “step of” or the phrase “steps of” inreferring to one or more steps of the claim or of another claim does notmean that 35 U.S.C. § 112, paragraph 6, applies to that step(s).

With respect to a means or a step for performing a specified function inaccordance with 35 U.S.C. § 112, paragraph 6, the correspondingstructure, material or acts described in the specification, andequivalents thereof, may perform additional functions as well as thespecified function.

Computers, processors, computing devices and like products arestructures that can perform a wide variety of functions. Such productscan be operable to perform a specified function by executing one or moreprograms, such as a program stored in a memory device of that product orin a memory device which that product accesses. Unless expresslyspecified otherwise, such a program need not be based on any particularalgorithm, such as any particular algorithm that might be disclosed inthe present application. It is well known to one of ordinary skill inthe art that a specified function may be implemented via differentalgorithms, and any of a number of different algorithms would be a meredesign choice for carrying out the specified function.

Therefore, with respect to a means or a step for performing a specifiedfunction in accordance with 35 U.S.C. § 112, paragraph 6, structurecorresponding to a specified function includes any product programmed toperform the specified function. Such structure includes programmedproducts which perform the function, regardless of whether such productis programmed with (i) a disclosed algorithm for performing thefunction, (ii) an algorithm that is similar to a disclosed algorithm, or(iii) a different algorithm for performing the function.

Where there is recited a means for performing a function that is amethod, one structure for performing this method includes a computingdevice (e.g., a general purpose computer) that is programmed and/orconfigured with appropriate hardware to perform that function. Alsoincludes a computing device (e.g., a general purpose computer) that isprogrammed and/or configured with appropriate hardware to perform thatfunction via other algorithms as would be understood by one of ordinaryskill in the art.

VIII. Disclaimer

Numerous references to a particular embodiment does not indicate adisclaimer or disavowal of additional, different embodiments, andsimilarly references to the description of embodiments which all includea particular feature does not indicate a disclaimer or disavowal ofembodiments which do not include that particular feature. A cleardisclaimer or disavowal in the present application shall be prefaced bythe phrase “does not include” or by the phrase “cannot perform”.

IX. Incorporation By Reference

Any patent, patent application or other document referred to herein isincorporated by reference into this patent application as part of thepresent disclosure, but only for purposes of written description inaccordance with 35 U.S.C. § 112, paragraph 1 and enablement inaccordance with 35 U.S.C. § 112, paragraph 1, and should in no way beused to limit, define, or otherwise construe any term of the presentapplication where the present application, without such incorporation byreference, would not have failed to provide an ascertainable meaning,but rather would have allowed an ascertainable meaning for such term tobe provided. Thus, the person of ordinary skill in the art need not havebeen in any way limited by any embodiments provided in the reference

Any incorporation by reference does not, in and of itself, imply anyendorsement of, ratification of or acquiescence in any statements,opinions, arguments or characterizations contained in any incorporatedpatent, patent application or other document, unless explicitlyspecified otherwise in this patent application.

X. Prosecution History

In interpreting the present application (which includes the claims), oneof ordinary skill in the art shall refer to the prosecution history ofthe present application, but not to the prosecution history of any otherpatent or patent application, regardless of whether there are otherpatent applications that are considered related to the presentapplication, and regardless of whether there are other patentapplications that share a claim of priority with the presentapplication.

Embodiments

In various embodiments, a bet is available that pays off if a group ofhorses finish a race in a particular order. For example, with horses 1,2, 3, 4, 5, 6, 7, and 8, the bet may pay off only if horses finish with#8 in first place, #7 in second, #6 in third, #5 in fourth, #4 in fifth,#3 in sixth, #2 in seventh, and #1 in eighth. In some embodiments, thebet pays off only if all horses in a race finish in an order mostcontrary to common expectation. For example, the bet pays off if thefavorite horse (the horse providing the lowest payout per dollar wageredin a pari-mutuel environment) finishes last, the next most favored horsefinishes second to last, the third most favored horse finishes third tolast, and so on, with the biggest underdog finishing first. In suchembodiments, the bet may be termed a “reverse bet”. Since a reverse betoften pays only in the case of a very unlikely event, the amount paidmay be quite large. The possibility for a large payout may be anappealing reason for horse racing fans to place bets. Although referenceherein will often be made to horse racing, it should be understood thata reverse bet may be available with dog racing, car racing, or any otherapplicable contest.

Terminology

Payoff odds: the amount that will be paid per unit wager should a givenevent occur (e.g., a given horse winning a race). Payoff odds may bewritten as “x:y” indicating that x units are paid per y units wagered.Note that the wager is also returned to the bettor. Payoff odds may benormalized to be written as “z:1”, indicating that z units are paid perunit wagered. Equivalently, normalized payoff odds may be simply writtenas “z”. In general, payoff odds for an event are greater the moreunlikely the event, and vice versa. Thus, for example, a favored horsein a race will have lower payoff odds than a long-shot horse.

Reverse bet: a bet which pays off if all horses (or other contenders) ina race finish in an order most contrary to common expectation (e.g., asindicated by payoff odds in a pari-mutuel system).

Determining Which are the Favored Horses

The determination of the horse most favored to win, the horse next mostfavored to win, and so on may occur:

-   -   Based on the payoff odds in a pari-mutuel system. The horse with        the lowest payoff odds may be determined to be the favorite, the        horse with the next lowest payoff odds may be determined to be        the 2^(nd) most favored horse, and so on.    -   By vote or decision of a group of racing fans or enthusiasts.    -   By vote or decision of one or more experts in the field, such as        professional gamblers, bookmakers, sports journalists, etc.    -   Using certain algorithms applied to historical data about the        horses, race track, jockeys, trainers, race style, etc.

Computing the Probability of a Reverse Bet Winning

In various embodiments, the probability of a horse winning a race isderived from the payoff odds for the horse. In a pari-mutuel embodiment,let W represent the amount of money in the win pool for a race, whichincludes all monies that people have bet on various horses in the raceto win. Let w₁, w₂, w₃ . . . represent the amount of money people havebet on horse 1, horse 2, horse 3, etc., to win. Note that W=w₁+w₂+w₃+ .. . . Let t represent the take percent, or the percentage of money thatwill be removed from the win pool for taxes, fees, track profits, and soon. What remains to be distributed to people who bet on the winninghorse is thus W*(1−t). If horse k wins, then the people who bet on horsek receive W*(1−t) after having put in w_(k), providing them payoff oddsof W*(1−t)/w_(k). Let p₁, p₂, p₃, etc. represent the probabilities thathorses 1, 2, 3, etc. will win. These probabilities are not necessarilyknown, but may be implied if one assumes: 1) bettors wish to placewagers even if such wagers provide expectations of loss; 2) given thatbettors do wish to place wagers, bettors wish to maximize their expectedwinnings per dollar wagered; 3) bettors all agree on the probabilitythat each horse will win; 4) bettors can place wagers of infinitelysmall amounts; and 5) bettors can bet as often as they want. Theexpected winnings per dollar wagered from a bet on horse k is given byp_(k)*W*(1−t)/w_(k). If the expected winnings for horse k are greaterthan for any other horse, it is anticipated that bettors would startplacing additional bets on horse k. This would have the effect ofincreasing both w_(k) and W, though w_(k) would increase by a greaterpercentage. Thus, the expected winnings for horse k per dollar wageredwould decrease, while the increase in W would drive up expected winningsfor other horses. In this way, expected winnings for all horses wouldtend to equalize. It has been shown above that W*(1−t) is distributedfor every W wagered. Thus, if the expected winnings over all horses isthe same, expected winnings are W*(1−t)/W, or 1−t per dollar wagered.Thus we have p_(k)*W*(1−t)/w_(k)=(1−t), or p_(k)=w_(k)/W. Thus, theprobability of a horse winning can be derived as the amount of wagersplace on that horse to win divided by the total amount of wagers placedon any horse to win.

In various embodiments, the probability of a horse winning (or offinishing in any other place) may be derived using other algorithms,such as statistical algorithms or neural networks which predict ahorse's performance based on a number of inputs. Such inputs may includethe horse's age, performance history, days of rest, favored courses,trainer, jockey, lineage, gender, weight, health history, position inthe starting gate, and so on. In various embodiments, the probability ofa horse winning (or finishing in any other place) may be determined byan expert in the field, such as a sports journalist.

Once probabilities p₁, p₂, p₃, etc., have been obtained for each horseto win, additional assumptions can be made in order to derive theprobability of a horse finishing second, third, etc., given a differenthorse finishes first. In some embodiments, it is assumed that out of agiven group of horses, regardless of any other events that may occur,the probability of horse n finishing in place q given that horse mfinished in place q−1 is equal to the a-priori probability that horse nfinishes in place q−1 divided by one minus the probability that horse mfinishes in place q−1. For example, the probability that horse 3finishes second given that horse 5 finishes first is equal to p₃/(1−p₅).

With the above assumptions the probability that the reverse bet wins canbe derived. Assume in an N-horse race, p₁>p₂>p₃> . . . >p_(N) so thatthe reverse bet pays off if horse 1 finishes last, horse 2 finishessecond to last, and so on, with horse N finishing first. Now, theprobability of horse N finishing first is p_(N). The probability ofhorse N−1 finishing second given that horse N finished first isp_(N−1)/(1−p_(N)). The probability of horse N−2 finishing third giventhat horse N finished first and horse N−1 finished second is:

(p_(N − 2)/(1 − p_(N)))/(1 − p_(N − 1)/(1 − p_(N))) = (p_(N − 2)/(1 − p_(N)))/((1 − p_(N) − p_(N − 1))/(1 − p_(N))) = p_(N − 2)/(1 − p_(N) − p_(N − 1))

The probability of horse N−3 finishing fourth given that horse Nfinished first, horse N−1 finished second, and horse N−2 finished thirdis:

  p_(N − 3)/(1 − p_(N) − p_(N − 1))/(1 − p_(N − 2)/(1 − p_(N) − p_(N − 1))) = p_(N − 3)/(1 − p_(N) − p_(N − 1))/((1 − p_(N) − p_(N − 1) − p_(N − 2))/(1 − p_(N) − p_(N − 1))) = p_(N − 3)/(1 − p_(N) − p_(N − 1) − p_(N − 2))

The probability for all the horses finishing in reverse order is thusgiven by:Π_(k=1 . . . N)p_(k)/Π_(k=1 . . . N−1)(1−Σ_(j=1 . . . k)p_(N−j+1))

A simple example is as follows. Suppose there are four horses in a race.$400 is bet on horse 1, $300 on horse 2, $200 on horse 3, and $100 onhorse 4. Thus, w₁=$400, w₂=$300, w₃=$200, w₄=$100. The amount of moneyput into the win pool, W, is thus $1000. The probability of horse 1winning can be derived as p₁=w₁/W=$400/$1000=0.4. Similarly,p₂=$300/$1000=0.3, p₃=$200/$1000=0.2, p₄=$100/$1000=0.1.

The probability of all four horses finishing in reverse order is:

p₁ * p₂ * p₃ * p₄/((1 − p₄) * (1 − p₃ − p₄) *     (1 − p₂ − p₃ − p₄))=     0.4 * 0.3 * 0.2 * 0.1/  ((1 − 0.1)*    (1 − 0.2 − 0.1) *   (1 − 0.3 − 0.2 − 0.1)) = 0.0095

It will be appreciated that this probability is significantly lower thanif all four horses were considered roughly equal contenders. If allhorses were equal, the probability of a given order of horses would be¼*⅓*½=0.042.

It should also be appreciated that the above formula for the probabilityof a finish in reverse order is based on one set of assumptions, anddoes not necessarily hold under alternate sets of assumptions.

One set of assumptions can be used to compute the probabilities of the kleast favored horses finishing in the first k places in reverse order tothe order that would be expected. For example, the probability of horsesN and N−1 finishing first and second, respectively, in a race can becomputed as: p_(N)*p_(N−1)/(1−p_(N)). Following the finishes in thefirst k places, it may then be assumed that all orders of finish forplaces k+1 through N are equally likely. This assumption might be basedon the belief, for example, that horses do not try hard in a raceanymore once it is clear they will not finish in the first k places. Forexample, only the first k places may award a purse. Thus, theprobability of any particular order of finishes in places k+1 through N,given that particular horses finish in places 1 through k is 1/((N−k)!).Modifying the 4-horse example above, the probability for horse 4 tofinish first and horse 3 to finish second is:

  p₄ * p₃/(1 − p₄) = 0.1 * 0.2/(1 − 0.1) = .022

Given that horse 4 finishes first and horse 3 finishes second, theprobability that horse 2 will finish third and horse 1 will finishfourth is now assumed to be 1/((4−2)!)=½. Thus, the probability for allfour horses finishing in reverse order would be: 0.022*½=0.011.

Betting Structure

Pari-Mutuel

In some embodiments, bettors may choose any order of finish for thehorses in a race. Bettors place a bet on their chosen order. All moneythat has been bet by any bettor on a particular order of finish is thenplaced into a pool. A percentage of the pool may then be taken out fortaxes, track profits, and so on. The remainder of the pool may then bepaid to a bettor if his chosen order of finish transpires in the actualrace. For example, suppose a bettor bets that horse 3 will finish first,horse 1 will finish second, horse 2 will finish third, horse 4 willfinish fourth, horse 5 will finish fifth, horse 6 will finish sixth,horse 7 will finish seventh, and horse 8 will finish eighth. If theoutcome of the race proves the bettor to be correct in his choice, thenthe bettor will be paid the entire pool of bets (less any amount takenout) on the horses in a race all finishing in a particular order. If twoor more bettors have placed bets on a particular winning order, then thetwo or more bettors may share the pool in proportion to the bet amountsplaced on the winning order.

In some embodiments, if no better has bet on exactly the order of finishthat has come to pass, then the winning bettor may be the one who hasmatched the most places correctly. For example, suppose six of eighthorses have finished in exactly the places predicted by a bettor, buttwo of eight have not. If no other bettor has matched six places, thenthe bettor having matched six places will win the pool of bets (lesstake outs). If several bettors have matched six places then, in someembodiments, all may share the pool in proportion to the amounts bet. Insome embodiments, among multiple bettors making a partial match, thewinning bettor may be the one who has correctly predicted the earliestplaces. For instance, a bettor who has correctly predicted the horsesfinishing first through sixth may win over a bettor who has correctlypredicted the horses finishing third through eighth.

In some embodiments, if no bettor has correctly predicted the entireorder of finish in a race, then the pool of bets may not be awarded.Rather, the pool may be kept by the track, carried over to the nextrace, donated to charity, or put to some other use.

Fixed Odds

A race track, casino, bookmaker, or other establishment may offer fixedpayoff odds on a reverse bet. For example, a race track may offer payoffodds of 100,000:1 on a reverse bet. In various embodiments, fixed oddsmay be offered for any bet that selects all horses to finish in aparticular order.

Fixed Pool

A race track, casino, bookmaker, or other establishment may offer afixed pool to be paid out in the event that a reverse bet wins. Forexample, a $1,000,000 pool is offered. The pool is then divided amongall winning bettors. Note that in various embodiments, with a fixedpool, a bettor's payout is dependent upon bets made by other bettors,whereas with fixed odds, the bettor's payout is not.

Growing Pool

A pool may be offered that grows for every race in which a reverse betdoes not win. For example, suppose in a first race that $1000 worth ofbets are placed on a reverse bet. If the reverse bet wins, then the pool(less take outs) may be divided among the winners. However, if thereverse bet does not win, then a portion of the pool (e.g., 75% aftertake outs) may be carried over to a second race. Suppose that $500 iscarried over to the second race and that $2000 worth of bets are placedon the second race. Of the $2000, suppose that $400 are removed fortaxes, track profits, and so on. There is then $2100 available forpayout in the second race, including the $500 carried over from thefirst race, and the $1600 derived from new bets on the second race. Ifthere is no winner in the second race, then a portion of the $2100 maybe carried over to a third race, and so on.

Carry-Over of Wagers in a Pool

As described above, when there is no winner of a reverse bet (or of someother bet where a particular order of finish is required) for a firstrace, then a portion of bets placed may be awarded to a winning bettorin a subsequent race. Thus, there may be a growing pool of moneyavailable to be awarded for so long as there is no winner of a reversebet.

-   -   In some embodiments, 100% of the amount available to be paid out        in a first race is carried over to a second race should there be        no winner of a reverse bet in the first race. Note that the 100%        available to be paid out may include the total amount of bets        placed less any amounts taken out.    -   In some embodiments, less than 100% is carried over to a second        race. The money not carried over may be kept by the track,        donated to charity, paid as a consolation prize for anyone who        has correctly chosen e.g., the horses that would finish in at        least 6 of the places, etc. Exemplary percentages to be carried        over are 75%, 50%, and (66+⅔)%.    -   In some embodiments, a pool of money to be paid out for a        winning reverse bet may be applicable only to certain races. A        pool may be applicable to:        -   Races run only on a particular track        -   Races run only in a particular geographic region, such as a            state        -   Races run only during a particular time period, such as            during a particular day    -   In some embodiments, a pool of money to be paid out for a        winning reverse bet may grow based on money bet on reverse bets        at tracks throughout a region, throughout a country, or        throughout the entire world. With contributions to the pool        coming from many tracks, the pool may grow quite large in a        short period of time. Such a large pool might provide an        exciting experience for bettors placing reverse bets.

Ties and Pool Division

In some embodiments, it is foreseeable that, should a reverse bet win,there would be multiple winners. In the event of multiple winners:

-   -   The amount to be paid out may be allocated to all the winners in        proportion to the amounts bet by the winners.    -   There may be a drawing or lottery among the winners to determine        who will receive the entire pool. In the drawing, each of the        winners may receive tickets or other chances to win which are        based on the amount wagered on the reverse bet. For example,        each winner may receive a number of tickets in a drawing equal        to the number of dollars wagered on the reverse bet.    -   There may be no awarding of the pool.    -   The pool may be awarded based on some kind of play-off among the        winners. For example, the winner who makes the most accurate        prediction for one or more future races may take the entire        pool.

Choosing the Bet

-   -   In some embodiments, there is only a single order of finish,        e.g., an order of finish in reverse of common expectation, that        is available. In such embodiments, a bettor may simply indicated        whether or not he wishes to bet on this order of finish.    -   In some embodiments the order of finish required in a reverse        bet is based on the payoff odds after the close of betting.    -   In some embodiments, the order of finish required in a reverse        bet is based on the payoff odds at the moment the reverse bet is        placed.    -   In some embodiments, an order of finish is randomly selected for        a bettor, e.g., using a random number generator. The bettor then        places his bet on this order of finish. The order of finish may        be chosen before or after the bettor makes his bet. If before,        the bettor may have the choice of making the bet or not.    -   In some embodiments, the bettor may select an order of finish.        The bettor may fill out a card where a series of identifiers is        listed for all horses in a race. For instance, the names of all        the horses in a race are listed. The bettor may then indicate,        for each horse, an expected place, such as first place, second        place, etc. The bettor may make his indication by filling in one        of a set of numbered bubbles. The bettor may make his indication        by writing in a place number. In some embodiments, the places        are listed (e.g., first place through eighth place), and next to        each placed the bettor indicates the identifier of a particular        horse.    -   A bettor may place a bet and/or select an order of finish using        a physical substrate, such as a paper betting slip, using an        electronic interface at a self-service betting machine, using a        GUI for betting over the Internet, using a phone touchpad for        bets placed over the phone, or in any other manner.

Availability of Reverse Bet

-   -   The bet may only be available if there are at least x number of        horses in a race. As will be appreciated, the likelihood of the        reverse bet winning may be quite high if there are only a small        number of horses in a race.    -   The bet may only be available if certain information is already        commonly known about one or more horses.        -   The horse(s) has competed before        -   The horse(s) is of a known lineage (e.g., descendent from            known race horses)        -   The jockey(ies) has competed before        -   The horse has been tested for drugs    -   The bet may be available only in certain tracks, such as tracks        that are considered in a certain tier, have been around a        certain length of time, have established a good reputation, are        in a certain location, etc.

Preventing Cheating and Manipulation

It is possible that the payoff odds for a horse winning a race might bemanipulated in such a way that the payoff odds do not accuratelyrepresent the true probability of the horse winning the race. Forexample, in a pari-mutuel system, a person might place a very largewager on a horse even though the horse is known to be an insignificantcontender. Such a wager might artificially alter the payoff odds for thehorse such that the horse becomes the favorite. In this way, the personcan increase the likelihood that horses in the race will finish in anorder opposite that which would be expected from examination of thepayoff odds. Thus, various embodiments may discourage manipulation ofthe odds. In some embodiments, a reverse bet may not be available or nothonored if:

-   -   The probabilities for horses finishing in various places as        derived from the payoff odds are significantly divergent from        the probabilities set forth by one or more human experts or        computer algorithms. For example, if the probability of any        horse winning, as calculated from the payoff odds, is more than        0.1 away from the probability set forth by an expert, the        reverse bet may not be honored.    -   The total amount bet on individual horses to win is less than a        predetermined amount, e.g., $10,000.    -   The total number of bettors is less than a predetermined number,        e.g., 500.    -   More than a predetermined percent of the amounts bet on horses        to win is accounted for by less than a predetermined number of        people. For example, if more than 20% of the amounts bet on        horses to win were placed by less than 10 people, then the        reverse bet may not be honored.    -   More than a predetermined percent of the number of bets placed        on horses to win is accounted for by less than a predetermined        number of people.

The following is a list of embodiments, not claims.

Applicants claim:

A. An apparatus comprising a computing device operable to:

-   -   receive a first set of bets for a first horse to win a race        (e.g., 12 different people may place a bet such that if the        first horse wins, the 12 people will win money from those who        have bet on other horses to win);    -   receive a second set of bets for a second horse to win the race;    -   determine, based on the first set of bets and the second set of        bets, an order in which the first and second horses might finish        the race;    -   receive from a bettor a third bet for the order to transpire;    -   determine actual results of the race; and    -   pay the bettor an amount which is based on the third bet, the        order, and the actual results of the race.

The order in which the first and second horses might finish the race ismerely a possibility of what might happen. As such the possibility neednot be realistic, likely, or need not actually ever happen. In variousembodiments, the order determined may be an order where the horse forwhich the most amount of money has been bet to win finishes last, andthe horse for which the lease amount of money has been bet to winfinishes first. Thus, the determined order may actually represent anorder of finish that is least likely to occur. Once the order has beendetermined, the bettor may make the third bet that the order itself willhappen. Thus, the third bettor may place the third bet not on any oneparticular horse, but on an order in which a plurality of horses willfinish. Once the actual results of the race of been determined (e.g.,once the race has been run), the third bettor may be paid.

B. The apparatus of embodiment A in which to receive a second set ofbets includes to receive a second set of bets that total to less thanthe total of the first set of bets.

C. The apparatus of embodiment B in which to determine an order includesto determine, based on the first set of bets and the second set of bets,that the second horse will finish the race before the first horse.

D. The apparatus of embodiment A in which to pay the bettor includes topay the bettor a positive amount which is based on the third bet if theactual results of the race match the order.

E. An apparatus comprising a computing device operable to:

-   -   determine a number of participants in a race;    -   determine if the number of participants exceeds a predetermined        threshold;    -   receive, for each participant in the race, at least one bet that        the participant will win the race;    -   determine, based on the received bets, a potential order for the        participants to finish the race;    -   offer, if the number of participants exceeds the predetermined        threshold, a fixed prize pool for any bet that is successfully        made that the potential order will transpire;    -   receive a first bet from a first bettor that the potential order        will transpire;    -   determine an actual order of the race;    -   determine whether the actual order matches the potential order;        and    -   provide at least a portion of the fixed prize pool to the first        bettor.

The fixed prize pool may represent a fixed amount of money. The sameamount of money may be offered for every race meeting certainconditions, such as races having more participants than thepredetermined threshold. The fixed prize pool may be 1 million dollars,for example. The fixed prize pool may not vary even though the number ofbets on races may vary.

F. The apparatus of embodiment E in which to determine a number ofparticipants in a race includes to determine a number of horses in arace.

G. The apparatus of embodiment E in which to determine a number ofparticipants in a race includes to determine a number of one of: (a)horses, (b) dogs, (c) cars, (d) camels, (e) sail boats, (f) people, (g)runners, (h) cyclists, (i) swimmers, (j) boats, and (k) computergenerated characters.

H. The apparatus of embodiment E in which the computing device isfurther operable to cause to be displayed an indication of the size ofthe fixed prize pool. For example, the computing device may instruct apublic monitor or display to show “$1,000,000” or any other indicationof the size of the fixed prize pool.

I. The apparatus of embodiment E in which to offer includes to offer, ifthe number of participants exceeds the predetermined threshold, onemillion dollars to be divided among all bettors who successfully betthat the order will transpire.

J. The apparatus of embodiment E in which to determine a potential orderincludes to determine, based on the received bets, a potential order inwhich it is least likely that the participants will finish the race. Forexample, the potential order may have the horse on which the leastamount was wagered finishing first, the horse on which the next leastamount was wagered finishing second, and so on.

K. The apparatus of embodiment J in which to determine a potential orderincludes to determine an order such that the lower the total of betsplaced on a given participant, the earlier the given participant willfinish the race.

L. The apparatus of embodiment E in which the computing device isfurther operable to cause to be displayed an indication of the potentialorder. The apparatus may cause to be displayed on a public monitor thepotential order.

M. The apparatus of embodiment L in which to cause to be displayed anindication of the potential order includes to cause to be displayed inindication that a first participant will finish first, that a secondparticipant will finish second, that a third participant will finishthird, that a fourth participant will finish fourth, that a fifthparticipant will finish fifth, that a sixth participant will finishsixth, that a seventh participant will finish seventh, that an eighthparticipant will finish eighth, that a ninth participant will finishninth, that a tenth participant will finish tenth, that an eleventhparticipant will finish eleventh, and that a twelfth participant willfinish twelfth.

N. The apparatus of embodiment E in which to provide at least a portionof the fixed prize pool to the first bettor includes to:

-   -   determine a number of bettors that had bet that the potential        order would transpire;    -   divide the fixed prize pool by the number of bettors, thereby to        generate a number of substantially equal portions of the fixed        prize pool; and    -   provide to the first bettor one of the number of portions.

Thus, for example, if four bettors had bet on the potential order, thefixed prize pool may be divided into four equal portions. Thus, forexample, a $1 million prize pool may be divided into four equal portionsof $250,000. Each of the four bettors may receive $250,000.

O. The apparatus of embodiment E in which to determine if the number ofparticipants exceeds a predetermined threshold includes to determine ifthe number of participants exceeds seven.

P. An apparatus comprising a computing device operable to:

-   -   receive, for each participant in a race, at least one bet that        the participant will win the race;    -   determine, based on the received bets that the respective        participants will win the race, a first potential order for the        participants to finish the race;    -   receive from a first bettor, after determining a first potential        order, a first bet that the first potential order will        transpire;    -   receive for a particular participant in the race, after        receiving the first bet, an additional bet that the particular        participant will win the race;    -   determine, based on the additional bet, a second potential order        for the participants to finish the race;    -   determine an actual order in which the participants finished the        race; and    -   provide payment to the first bettor based on the actual order        and at least one of the first potential order and the second        potential order.

The first potential order above may be determined such that the horsewith the least amount bet on it to win is to finish first, the horsewith the next least amount bet on it to win is to finish second, and soon. However, once the additional bet is placed, a first horse that hadless bet on it to win as compared with a second horse, may now have morebet on it to win than does the second horse. Thus, a second potentialorder may be determined where the first and second horses have switchedplaces as compared to the first potential order.

Q. The apparatus of embodiment P in which to provide payment includes toprovide payment to the first bettor if the actual order matches thefirst potential order.

In some embodiments, after a first bettor makes a bet on a firstpotential order, his bet remains on that same first potential order,even though subsequent bets on various horses to win may mean that thefirst potential order is no longer deemed the least likely to transpire.

R. The apparatus of embodiment P in which to provide payment includes toprovide payment to the first bettor if the actual order matches thesecond potential order.

In some embodiments, the first bettor bets on the order of finish thatwill be deemed least likely following the close of betting. Thus, evenif currently the first potential order is deemed the least likely, thesecond potential order may be the order that is deemed least likely atthe close of betting, such as after subsequent bets have been placed onother horses. The bet made by the first bettor may then win only if thesecond potential order actually transpires.

S. The apparatus of embodiment P in which to determine a secondpotential order includes to determine, based on the additional bet, asecond potential order for the participants to finish the race, in whichthe second potential order is different from the first potential order.

T. The apparatus of embodiment P in which to determine a secondpotential order includes to determine, based on the additional bet, asecond potential order for the participants to finish the race, in whichthe particular participant finishes in a worse position in the secondpotential order than the particular participant finishes in the firstpotential order.

The invention claimed is:
 1. A scale comprising a plurality of weightsensors; a communications port; a display device; at least one processorto: detect a plurality of weight readings from the plurality of weightsensors, each weight sensor being arranged to accommodate a foot of ahorse; compare the plurality of weight readings; identify whether a pairof the weight readings diverge by more than a predetermined threshold;render on the display device an indication of an injury of the horse, ifthe pair of the weight readings diverge by more than a predeterminedthreshold; and transmit, via the communication port, the indication ofthe injury to a server enabled to compute horse racing odds based atleast partially on the injury indication.
 2. The scale of claim 1,wherein a given weight sensor is configured to transmit a weight readingto the at least one processor periodically.
 3. The scale of claim 2,wherein the at least one processor is further configured to compute anaverage of weight readings received periodically from the given weightsensor.
 4. The scale of claim 1, wherein a given weight sensor isconfigured to transmit a weight reading to the at least one processorevery sixty seconds.
 5. The scale of claim 1, wherein the predeterminethreshold is ten percent.
 6. The scale of claim 1, wherein the at leastone processor is configured to render weight determinations and apercentage of difference between the weight determinations on thedisplay device.
 7. The scale of claim 1, wherein a weight reading from agiven weight sensor is a function of time.
 8. A method comprisingdetecting, by at least one processor, a plurality of weight readingsfrom a plurality of weight sensors, each weight sensor being arranged toaccommodate a foot of a horse; comparing, by the at least one processor,the plurality of weight readings; identifying, by the at least oneprocessor, whether a pair of the weight readings diverge by more than apredetermined threshold; rendering, by the at least one processor, anindication of an injury of the horse on a display device, if the pair ofthe weight readings diverge by more than a predetermined threshold; andtransmitting, by the at least one processor, the indication of theinjury to a server enabled to compute horse racing odds based at leastpartially on the injury indication.
 9. The method of claim 8, furthercomprising receiving, by the at least one processor, a weight readingfrom a given weight sensor periodically.
 10. The method of claim 8,further comprising computing, by the at least one processor, an averageof weight readings received periodically from a given weight sensor. 11.The method of claim 8, further comprising receiving, by the at least oneprocessor, a weight reading from a given weight sensor every sixtyseconds.
 12. The method of claim 8, wherein the predetermine thresholdis ten percent.
 13. The method of claim 8, further comprising rendering,by the at least one processor, weight determinations and a percentage ofdifference between the weight determinations on the display device. 14.The method of claim 8, wherein a weight reading from s given weightsensor is a function of time.